A note on Ramsey size-linear graphs
نویسندگان
چکیده
We show that if G is a Ramsey size-linear graph and x,y 2 V(G ) then if we add a sufficiently long path between x and y we obtain a new Ramsey size-linear graph. As a consequence we show that if G is any graph such that every cycle in G contains at least four consecutive vertices of degree 2 then G is Ramsey size-linear. ß 2002 John Wiley & Sons, Inc. J Graph Theory 39: 1–5, 2002
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملRamsey numbers of ordered graphs
An ordered graph G< is a graph G with vertices ordered by the linear ordering <. The ordered Ramsey number R(G<, c) is the minimum number N such that every ordered complete graph with c-colored edges and at least N vertices contains a monochromatic copy of G<. For unordered graphs it is known that Ramsey numbers of graphs with degrees bounded by a constant are linear with respect to the number ...
متن کاملMinimal Ordered Ramsey Graphs
An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H ′) of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all e...
متن کاملRamsey-Type Results for Unions of Comparability Graphs
It is well known that the comparability graph of any partially ordered set of n elements contains either a clique or an independent set of size at least pn. In this note we show that any graph of n vertices which is the union of two comparability graphs on the same vertex set, contains either a clique or an independent set of size at least n 13 . On the other hand, there exist such graphs for w...
متن کاملA note on the Size-Ramsey number of long subdivisions of graphs
Let TsH be the graph obtained from a given graph H by subdividing each edge s times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph H , there exist graphs G with O(s) edges that are Ramsey with respect to TsH . Mathematics Subject Classificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 39 شماره
صفحات -
تاریخ انتشار 2002